A Priority Rule Development Method for Dynamic Job Shop Scheduling Using Neural Networks
نویسندگان
چکیده
منابع مشابه
1 Lagrangian Relaxation Neural Networks for Job Shop Scheduling
Manufacturing scheduling is an important but difficult task. Building on our previous success in developing optimization-based scheduling methods using Lagrangian relaxation for practical applications, this paper presents a novel Lagrangian relaxation neural network (LRNN) optimization techniques. The convergence of LRNN for separable convex programming problems is established. For separable in...
متن کاملScaling properties of neural networks for job-shop scheduling
This paper investigates the scaling properties of neural networks for solving job-shop scheduling problems. Specifically, the Tank-Hopfield linear programming network is modified to solve mixed integer linear programming with the addition of step-function amplifiers. Using a linear energy function, our approach avoids the traditional problems associated with most Hopfield networks using quadrat...
متن کاملLagrangian Relaxation Neural Networks for Job Shop Scheduling
Manufacturing scheduling is an important but difficult task. In order to effectively solve such combinatorial optimization problems, this paper presents a novel Lagrangian relaxation neural network (LRNN) for separable optimization problems by combining recurrent neural network optimization ideas with Lagrangian relaxation (LR) for constraint handling. The convergence of the network is proved, ...
متن کاملUsing Multi-Agent System for Dynamic Job Shop Scheduling
Today’s industries need more flexible scheduling systems able to produce new valid schedule in response to the modifications concerning orders, production processes and deliveries of materials. This paper introduces a multi-agent system applied to a job shop dynamic scheduling problem in which new production orders or deliveries arrive continuously and affect the already scheduled plan. We have...
متن کاملA New Method for Solving Dynamic Flexible Job Shop Scheduling Problems Integrating Genetic Algorithm and Priority Rules
Dynamic flexible job shop scheduling problems has been one of the important and strongly NP-hard problem of manufacturing systems for many years. Most of the proposed algorithms are based on priority rules; By using these rules, the arrived jobs go to a long queue of waited jobs and sometimes it takes a long time for a job to be processed. In this paper a new approach, integrating of priority r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series C
سال: 2006
ISSN: 0387-5024,1884-8354
DOI: 10.1299/kikaic.72.567